RETRACTED: Global solutions to spherically constrained quadratic minimization via canonical duality theory
نویسندگان
چکیده
منابع مشابه
Canonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming
This paper presents a perfect duality theory and a complete set of solutions to nonconvex quadratic programming problems subjected to inequality constraints. By use of the canonical dual transformation developed recently, a canonical dual problem is formulated, which is perfectly dual to the primal problem in the sense that they have the same set of KKT points. It is proved that the KKT points ...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملAdvances in Canonical Duality Theory with Applications to Global Optimization
Canonical duality theory is a potentially powerful methodology, which can be used to solve a wide class of discrete and continuous global optimization problems. This paper presents a brief review and recent developments of this theory with applications to some well-know problems including polynomial minimization, mixed integer and fractional programming, nonconvex minimization with nonconvex qu...
متن کاملAn Algorithm for Global Minimization of Linearly Constrained Quadratic Functions
A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.
متن کاملMinimization via Duality
We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata. The basic idea is that instead of constructing a maximal quotient we go to the dual and look for a minimal subalgebra and then return to the original category. Duality ensures that the mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Mechanics of Solids
سال: 2016
ISSN: 1081-2865,1741-3028
DOI: 10.1177/1081286515577122